IFS Fractal Code for Image Retrieval on Compression Domain
نویسندگان
چکیده
Digital image databases represent huge amount of data, automatic indexing and content base retrieval are crucial factors. IFS ( Iterated function system ) fractal code can be used to retrieve image and the position parameter of IFS code is replaced with the relative distance and direction parameter. A new algorithm of IFS fractal code for image retrieval on compression domain is presented in this paper. First,the inquired image and each image in the database are encoded by Jacquin fractal coding. Second, the image fractal feature vector and the distance of fractal code between two images are defined, and the distance between the inquired image and current image in the database are computed one by one. Finally, the preceding n frame images which are the smallest distance sum of fractal code are taken as the retrieval result. Experimental results show that compared with the direct image pixels similar matching strategy, our scheme shortens the retrieval time of compression domain greatly and guarantees the retrieval accuracy. Our proposed method is effective and feasible. Key-Words: Fractal code; Iterated function system; Image retrieval; Compression domain
منابع مشابه
New Method of Image Retrieval Using Fractal Code on the Compression Domain
Image retrieval and indexing techniques are important for efficient management of visual database. Many techniques are generally developed based on the associated compression domain. In the fractal domain, a fractal code is a contractive affine mapping that represents a similarity relation between the range block and the domain block in an image. A new algorithm of IFS fractal code for image re...
متن کاملFractal Compression Using Ifs Operators on Transforms
Standard fractal image compression techniques rely on using an IFS operator directly on the image function. However, sometimes it is more convenient to work on some transformed version of the image. For example, an MRI image is scanned in as frequency data. Thus, it is more natural to work on the Fourier Transform of the image rather than on the image itself. Furthermore, if your image quality ...
متن کاملMassively Parallel Processing Approach to Fractal Image Compression
In the last years Image Fractal Compression techniques (IFS) have gained ever more interest because of their capability to achieve high compression ratios while maintaining very good quality for the reconstructed image. The main drawback of such techniques is the very high computing time needed to determine the compressed code. In this paper, after a brief description of the IFS theory, we disc...
متن کاملFractal Image Compression through Weighted Error Minimisation in the Frequency Domain
IFS compression technique, proposed by Barnsley [1], has been widely studied because of its potentially high compression rates. Usually IFS code is determined by minimizing the rms error between a given image and its collage. As rms error is not a physiological metric, images obtained through the standard IFS coding evidence a lot of noise (blocking effect, bad definition). In order to reduce t...
متن کاملIFS-Type Operators on Integral Transforms
Most standard fractal image compression techniques rely on using an IFS operator directly on the image function. Sometimes, however , it is more convenient to work on a faithful representation of the image which, in certain applications, may be a transformed version of the image. For example, if an MRI image is scanned in as frequency data it may be more natural to work on the Fourier transform...
متن کامل